/*
    <one line to give the program's name and a brief idea of what it does.>
    Copyright (C) 2012  Jeremy W. Murphy <jeremy.william.murphy@gmail.com>

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/


#include "population.h"
#include "individual.h"
#include "selection.h"

#include <list>


namespace rmitgprime
{
    template <typename ReturnType>
    Individual<ReturnType> const &selection(Population<ReturnType> const &POP, unsigned const &N)
    {
        std::list<unsigned> l(POP);

        /*
         * Randomly pick N items from POP, keep the best one.  That means it only needs to keep the best and one for comparison.   Oh, but I want three unique individuals, nCk from memory.
         */
    }
}
